Computational approach for optimal sensor setup

نویسندگان

  • Xiaoping Qian
  • Kevin G. Harding
چکیده

Xiaoping Qian Kevin G. Harding, MEMBER SPIE General Electric Company Global Research Center Inspection and Manufacturing Technologies Schenectady, New York 12301 E-mail: [email protected] Abstract. Optical metrology has been widely used in quality inspection. However, the sensor setup during part inspection is often done in an ad hoc way. This leads to unnecessarily high signal dynamic range. Consequently, optical sensors do not have sufficient light dynamic range capabilities especially for shiny surface measurement. We present a computational approach for optimal sensor setup that takes into account the sensor/part interaction to decrease signal dynamic range and to increase model coverage for structured light or similar optical inspection systems. First, we transform the signal dynamic range issue into a distance problem in a spherical map. We then present novel algorithms on the spherical map to search a near-optimal sensor orientation. Based on this nearoptimal orientation, we use a gradient method to obtain the free-optimal solution that gives the lowest possible dynamic range. Experimental results demonstrated that under the optimal orientation, there is lower signal dynamic range and better model coverage. Future work on extending this method to multiple sensor planning, sensor design, and stage design for large part inspection is also discussed. © 2003 Society of Photo-Optical Instrumentation Engineers. [DOI: 10.1117/1.1566777]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A genetic algorithm approach for problem

In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

متن کامل

Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

متن کامل

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003